Hyperplane partitions and difference systems of sets
نویسندگان
چکیده
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper gives new constructions of DSS obtained from partitions of hyperplanes in a finite projective space, as well as DSS obtained from balanced generalized weighing matrices and partitions of the complement of a hyperplane in a finite projective space. ∗Research supported by NSF Grant CCR-0310632.
منابع مشابه
Difference systems of sets and cyclotomy
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cyclic difference sets was introduced in [6] and applied to cyclic difference sets (n, (n−1)/2, (n−3)/4) of Paley type, where n ≡ 3 (mod 4) is a prime number. This paper develops similar constructions for prime numbers n ≡ ...
متن کاملIn between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions
Let S be a finite set of points in general position in Rd. We call a pair (A,B) of subsets of S an (i, j)-partition of S, if |A| = i, |B| = j and there is an oriented hyperplane h with S∩h = A and with B the set of points from S on the positive side of h. (i, j)-Partitions generalize the notions of k-sets (these are (0, k)-partitions) and j-facets ((d, j)-partitions) of point sets as well as th...
متن کاملOn Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C, defined recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of...
متن کاملPartitions of difference sets and code synchronization
Difference systems of sets can be used to transform an arbitrary linear code to a coset of a linear code with a given comma-free index by means of a minimal increase of its length. The paper discusses some constructions of difference systems of sets obtained from cyclic difference sets and finite geometry.
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 113 شماره
صفحات -
تاریخ انتشار 2006